WORST_CASE(?,O(n^2))

Solution:
---------

  "0" :: [] -(0)-> "A"(12, 0)
  "0" :: [] -(0)-> "A"(15, 11)
  "0" :: [] -(0)-> "A"(15, 15)
  "a__tail" :: ["A"(1, 11)] -(8)-> "A"(1, 11)
  "a__zeros" :: [] -(4)-> "A"(1, 11)
  "cons" :: ["A"(1, 0) x "A"(12, 0)] -(1)-> "A"(1, 11)
  "cons" :: ["A"(12, 0) x "A"(12, 0)] -(12)-> "A"(12, 0)
  "mark" :: ["A"(12, 0)] -(5)-> "A"(1, 11)
  "tail" :: ["A"(12, 0)] -(12)-> "A"(12, 0)
  "tail" :: ["A"(1, 11)] -(1)-> "A"(1, 11)
  "zeros" :: [] -(0)-> "A"(12, 0)
  "zeros" :: [] -(0)-> "A"(15, 11)
  "zeros" :: [] -(0)-> "A"(15, 15)


Cost Free Signatures:
---------------------

  "0" :: [] -(0)-> "A"_cf(0, 0)
  "a__tail" :: ["A"_cf(0, 0)] -(0)-> "A"_cf(0, 0)
  "a__zeros" :: [] -(0)-> "A"_cf(0, 0)
  "cons" :: ["A"_cf(0, 0) x "A"_cf(0, 0)] -(0)-> "A"_cf(0, 0)
  "mark" :: ["A"_cf(0, 0)] -(0)-> "A"_cf(0, 0)
  "tail" :: ["A"_cf(0, 0)] -(0)-> "A"_cf(0, 0)
  "zeros" :: [] -(0)-> "A"_cf(0, 0)


Base Constructors:
------------------
  "\"0\"_A" :: [] -(0)-> "A"(1, 0)
  "\"0\"_A" :: [] -(0)-> "A"(0, 1)
  "\"cons\"_A" :: ["A"(1, 0) x "A"(1, 0)] -(1)-> "A"(1, 0)
  "\"cons\"_A" :: ["A"(0, 0) x "A"(1, 0)] -(0)-> "A"(0, 1)
  "\"tail\"_A" :: ["A"(1, 0)] -(1)-> "A"(1, 0)
  "\"tail\"_A" :: ["A"(0, 1)] -(0)-> "A"(0, 1)
  "\"zeros\"_A" :: [] -(0)-> "A"(1, 0)
  "\"zeros\"_A" :: [] -(0)-> "A"(0, 1)